一种水相脱卤催化剂的红外光谱解析

水相脱卤催化剂PVP-PdCl2-MnCl2/GLM-PEG400,用于催化难溶于水的芳香卤化物水相脱卤,对芳香卤化物呈现出高的脱卤活性.通过IR光谱表征探讨了催化剂各组分在催化脱卤中的作用.     

具有扩散的Lotka-Volterra系统的持续性

利用最大值原理结合上、下解的方法，讨论了一类具有扩散的竞争－捕食的Lotka-Volterra系统静态解的存在性与持续生存。     

基于CAPPFramework的CAPP系统的开发与应用

在国家863CIMS目标产品CAPPFramework系统的基础上，研究了面向对象的信息建模技术、信息模型驱动的所见即所得工艺设计技术、工作流技术．并在此基础上进行集成化、智能化计算机辅助工艺设计(CAPP)的应用与开发，实现了工艺设计的自动化，基本达到了在信息集成基础上的工艺设计与工艺信息管理一体化的目的，对企业的CAPP实施具有一定的参考价值．     

Enclosure results for quasilinear systems of variational inequalities

In this paper we consider systems of quasilinear elliptic variational inequalities, and prove the existence of minimal and maximal (in the set theoretical sense) solutions within some ordered interval of an appropriately defined pair of sub- and supersolutions. We show that the notion of sub- and supersolutions of variational inequalities introduced here is consistent with the usual notion of sub-supersolutions for (variational) equations. For weakly coupled quasimonotone systems of variational inequalities the existence of smallest and greatest solutions is proved.     

Mackey Theory for p-adic Lie Groups

This paper gives a p-adic analogue of the Mackey theory, which relates representations of a group of type G - H × t A to systems of imprimitivity.     

一类平面七次多项式系统赤道环的稳定性与极限环分支

本文研究一类平面七次多项式系统赤道环的稳定性和极限环分支，给出了系统的前12个奇点量公式，可积性条件及在赤道附近存在3个极限环的条件，较为精细地指出了极限环的存在位置。     

NO-2-I-体系双波长紫外分光光度法测定痕量亚硝酸根

在稀盐酸介质中,亚硝酸根氧化碘化钾的反应产物I-3在288nm和352nm处有两个强吸收峰.基于此建立了双波长紫外分光光度法测定痕量NO-2的新方法.该法简便、快速、选择性好,线性范围为0-0.4μg/mL,检出限为3.4×10-9g/mL.用于河水、井水、矿泉水中亚硝酸根的测定,结果令人满意.     

Measurements of edge-uncolorability

Cubic bridgeless graphs with chromatic index four are called uncolorable. We introduce parameters measuring the uncolorability of those graphs and relate them to each other. For k=2,3, let c_k be the maximum size of a k-colorable subgraph of a cubic graph G=(V,E). We consider r₃=|E|−c₃ and . We show that on one side r₃ and r₂ bound each other, but on the other side that the difference between them can be arbitrarily large. We also compare them to the oddness ω of G, the smallest possible number of odd circuits in a 2-factor of G. We construct cyclically 5-edge connected cubic graphs where r₃ and ω are arbitrarily far apart, and show that for each 1c<2 there is a cubic graph such that ωcr₃. For k=2,3, let ζ_k denote the largest fraction of edges that can be k-colored. We give best possible bounds for these parameters, and relate them to each other.     

On the Curvature of the Central Path of Linear Programming Theory

We prove a linear bound on the average total curvature of the central path of linear programming theory in terms of the number of independent variables of the primal problem, and independent of the number of constraints.     

The Central Limit Problem for Random Vectors with Symmetries

Motivated by the central limit problem for convex bodies, we study normal approximation of linear functionals of high-dimensional random vectors with various types of symmetries. In particular, we obtain results for distributions which are coordinatewise symmetric, uniform in a regular simplex, or spherically symmetric. Our proofs are based on Stein’s method of exchangeable pairs; as far as we know, this approach has not previously been used in convex geometry. The spherically symmetric case is treated by a variation of Stein’s method which is adapted for continuous symmetries. This work was done while at Stanford University.